Random walk on a polygon
نویسنده
چکیده
Abstract: A particle moves among the vertices of an (m + 1)-gon which are labeled clockwise as 0, 1, . . . , m. The particle starts at 0 and thereafter at each step it moves to the adjacent vertex, going clockwise with a known probability p, or counterclockwise with probability 1 − p. The directions of successive movements are independent. What is the expected number of moves needed to visit all vertices? This and other related questions are answered using recursive relations.
منابع مشابه
On the mixing rate of the triangulation walk
Let Tn denote the set of triangulations of a convex polygon K with n sides We study the random walk on Tn whose transitions are ips of one of the n internal diagonals of the current triangulation the choice of diagonal being random By bounding the conductance of this graph we show that the walk mixes rapidly namely in time O n A direct argument is given for the fact that the mixing rate is at l...
متن کاملThe length scale of 3-space knots, ephemeral knots, and slipknots in random walks
The probability that a random walk or polygon in the 3-space or in the simple cubic lattice contains a small knot, an ephemeral knot, or a slipknot goes to one as the length goes to infinity. The probability that a polygon or walk contains a “global” knot also goes to one as the length goes to infinity. What immerges is a highly complex picture of the length scale of knotting in polygons and wa...
متن کاملMonotonicity for excited random walk in high dimensions
We prove that the drift θ(d, β) for excited random walk in dimension d is monotone in the excitement parameter β ∈ [0, 1], when d ≥ 9.
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملOn the Mixing Rate of the Triangulation
Let T n denote the set of triangulations of a convex polygon K with n sides. We study the random walk on T n whose transitions are \\ips" of one of the n ? 3 internal diagonals of the current triangulation, the choice of diagonal being random. By bounding the conductance of this graph we show that the walk mixes rapidly, namely in time O(n). A direct argument is given for the fact that the mixi...
متن کاملCentral Limit Theorem in Multitype Branching Random Walk
A discrete time multitype (p-type) branching random walk on the real line R is considered. The positions of the j-type individuals in the n-th generation form a point process. The asymptotic behavior of these point processes, when the generation size tends to infinity, is studied. The central limit theorem is proved.
متن کامل